balancing domain decomposition造句
例句與造句
- G . Pencheva and I . Yotov, " Balancing domain decomposition for mortar mixed finite element methods ", Numer.
- because it can be understood as further development of the BDD ( balancing domain decomposition ) method . J . Mandel, " Balancing domain decomposition ", Comm.
- because it can be understood as further development of the BDD ( balancing domain decomposition ) method . J . Mandel, " Balancing domain decomposition ", Comm.
- In primal methods, such as Balancing domain decomposition and BDDC, the continuity of the solution across subdomain interface is enforced by representing the value of the solution on all neighboring subdomains by the same unknown.
- The name of the method was coined by Mandel and Dohrmann, J . Mandel and C . R . Dohrmann, " Convergence of a balancing domain decomposition by constraints and energy minimization ", Numer.
- It's difficult to find balancing domain decomposition in a sentence. 用balancing domain decomposition造句挺難的
- He developed the balancing domain decomposition method and, with coauthors, published the convergence proofs of the FETI, FETI-DP, and BDDC methods, and the proof of the equivalence of the FETI-DP and the BDDC methods.
- The BDDC method uses the same corner basis functions as, but in an additive rather than multiplicative fashion . J . Mandel and C . R . Dohrmann, " Convergence of a balancing domain decomposition by constraints and energy minimization ", Numer.
- BDD requires only solution of subdomain problems rather than access to the matrices of those problems, so it is applicable to situations where only the solution operators are available, such as in oil reservoir simulation by mixed finite elements . L . C . Cowsar, J . Mandel, and M . F . Wheeler, " Balancing domain decomposition for mixed finite elements ", Math.
- In domain decomposition methods, the construction of a coarse problem follows the same principles as in multigrid methods, but the coarser problem has much fewer unknowns, generally only one or just a few unknowns per subdomain or substructure, and the coarse space can be of a quite different type that the original finite element space, e . g . piecewise constants with averaging in balancing domain decomposition or built from energy minimal functions in BDDC . The construction of the coarse problem in FETI is unusual in that it is not obtained as a Galerkin approximation of the original problem, however.